A New Neighborhood for the QAP
نویسندگان
چکیده
Local search procedures are popular methods to solve combinatorial problems and neighborhood structures are the main part of those algorithms. This paper presents a new neighborhood for the Quadratic Assignment Problem. The proposed neighborhood is compared with the classical 2-exchange neighborhood.
منابع مشابه
Adaptive Memories for the Quadratic Assignment Problem
The paper proposes, compares and analyses different memory-based meta-heuristics for the quadratic assignment problem (QAP). Two of these methods (FANT and GDH) are new while two others (HAS-QAP and GTSH) are among the best for structured QAP instances. These methods are based on ant systems and genetic algorithms and they are presented under a unified general scheme, called adaptive memory pro...
متن کاملApplying Permutation Distance in VNS for QAP
In this paper, a new concept distance called permutation distance is proposed and exploited in detail. We combine it with the hamming distance and propose a group of new neighborhood structures in VNS for QAP. Numerical tests running on the standard benchmark library QAPLIB show that this approach would dramatically improve the performance of VNS for QAP.
متن کاملA new approach for data visualization problem
Data visualization is the process of transforming data, information, and knowledge into visual form, making use of humans’ natural visual capabilities which reveals relationships in data sets that are not evident from the raw data, by using mathematical techniques to reduce the number of dimensions in the data set while preserving the relevant inherent properties. In this paper, we formulated d...
متن کاملAn Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems
Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that research for solving the Quadratic Assignment Problem (QAP) using PSO approach has not much been investigated. In this paper, we design a hybrid meta-heuristic fuzzy scheme, called as variable neighborhood fuzzy particle ...
متن کاملVery Large-Scale Neighborhood Search for the Quadratic Assignment Problem
The Quadratic Assignment Problem (QAP) consists of assigning n facilities to n locations so as to minimize the total weighted cost of interactions between facilities. The QAP arises in many diverse settings, is known to be NP-hard, and can be solved to optimality only for fairly small size instances (typically, n ≤ 25). Neighborhood search algorithms are the most popular heuristic algorithms to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 30 شماره
صفحات -
تاریخ انتشار 2008